Gene algorithm for generalized tardiness flowshop problems

In this paper a generalized version of the tardiness flowshop permutation scheduling problems is considered. A mathematical programming formulation, in the form of a combinatorial optimization model, is also developed. Then a genetic algorithm is developed for solving the proposed problem. The efficiency of the developed algorithm is evaluated through a computational experiment, in which several classes’ of test problems is randomly generated. Through this experiment, the solutions obtained by the proposed algorithm are compared to the optimal solutions and the results are reported. The computational results revealed that the solutions of the proposed algorithm are very close the optimal solutions. An ANOVA statistical test is also conducted for evaluating the effect of the parameters of the test problems on the solutions obtained by the proposed algorithm and the results are reported.